<!DOCTYPE html>
<html lang="zh-CN">





<head>
  <meta charset="UTF-8">
  <link rel="apple-touch-icon" sizes="76x76" href="/michuanblog/img/favicon.png">
  <link rel="icon" type="image/png" href="/michuanblog/img/favicon.png">
  <meta name="viewport"
        content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no, shrink-to-fit=no">
  <meta http-equiv="x-ua-compatible" content="ie=edge">
  
  <meta name="theme-color" content="#2f4154">
  <meta name="description" content="Coding">
  <meta name="author" content="胡晗">
  <meta name="keywords" content="">
  <title>胡晗&#39;s Blog</title>

  <link  rel="stylesheet" href="https://cdn.staticfile.org/twitter-bootstrap/4.4.1/css/bootstrap.min.css" />



<!-- 主题依赖的图标库，不要自行修改 -->

<link rel="stylesheet" href="//at.alicdn.com/t/font_1749284_yg9cfy8wd6.css">



<link rel="stylesheet" href="//at.alicdn.com/t/font_1736178_pjno9b9zyxs.css">


<link  rel="stylesheet" href="/michuanblog/css/main.css" />

<!-- 自定义样式保持在最底部 -->


  <script  src="/michuanblog/js/utils.js" ></script>
<meta name="generator" content="Hexo 4.2.1"></head>


<body>
  <header style="height: 100vh;">
    <nav id="navbar" class="navbar fixed-top  navbar-expand-lg navbar-dark scrolling-navbar">
  <div class="container">
    <a class="navbar-brand"
       href="/michuanblog/">&nbsp;<strong>MiChuan</strong>&nbsp;</a>

    <button id="navbar-toggler-btn" class="navbar-toggler" type="button" data-toggle="collapse"
            data-target="#navbarSupportedContent"
            aria-controls="navbarSupportedContent" aria-expanded="false" aria-label="Toggle navigation">
      <div class="animated-icon"><span></span><span></span><span></span></div>
    </button>

    <!-- Collapsible content -->
    <div class="collapse navbar-collapse" id="navbarSupportedContent">
      <ul class="navbar-nav ml-auto text-center">
        
          
          
          
          
            <li class="nav-item">
              <a class="nav-link" href="/michuanblog/">
                <i class="iconfont icon-home-fill"></i>
                首页
              </a>
            </li>
          
        
          
          
          
          
            <li class="nav-item">
              <a class="nav-link" href="/michuanblog/archives/">
                <i class="iconfont icon-archive-fill"></i>
                归档
              </a>
            </li>
          
        
          
          
          
          
            <li class="nav-item">
              <a class="nav-link" href="/michuanblog/categories/">
                <i class="iconfont icon-category-fill"></i>
                分类
              </a>
            </li>
          
        
          
          
          
          
            <li class="nav-item">
              <a class="nav-link" href="/michuanblog/tags/">
                <i class="iconfont icon-tags-fill"></i>
                标签
              </a>
            </li>
          
        
          
          
          
          
            <li class="nav-item">
              <a class="nav-link" href="/michuanblog/about/">
                <i class="iconfont icon-user-fill"></i>
                关于
              </a>
            </li>
          
        
        
          <li class="nav-item" id="search-btn">
            <a class="nav-link" data-toggle="modal" data-target="#modalSearch">&nbsp;&nbsp;<i
                class="iconfont icon-search"></i>&nbsp;&nbsp;</a>
          </li>
        
      </ul>
    </div>
  </div>
</nav>

    <div class="view intro-2" id="background" parallax=true
         style="background: url('/michuanblog/img/default.png') no-repeat center center;
           background-size: cover;">
      <div class="full-bg-img">
        <div class="mask flex-center" style="background-color: rgba(0, 0, 0, 0.3)">
          <div class="container text-center white-text fadeInUp">
            <span class="h2" id="subtitle">
              
            </span>

            
          </div>

          
            <div class="scroll-down-bar">
              <i class="iconfont icon-arrowdown"></i>
            </div>
          
        </div>
      </div>
    </div>
  </header>

  <main>
    
      <div class="container nopadding-md">
        <div class="py-5" id="board"
          style=margin-top:0>
          
          <div class="container">
            <div class="row">
              <div class="col-12 col-md-10 m-auto">
                


  <div class="row mx-auto index-card">
    
    
    <div class="col-12 col-md-12 mx-auto index-info">
      <a class="index-header" href="/michuanblog/2020/09/13/lcof-58-1/">lcof_58_1</a>

      <a href="/michuanblog/2020/09/13/lcof-58-1/" class="index-excerpt">
        
        
          
        
        <div>LCOF58 - I 翻转单词顺序题目输入一个英文句子，翻转句子中单词的顺序，但单词内字符的顺序不变。为简单起见，标点符号和普通字母一样处理。例如输入字符串”I am a student. “，则输出”student. a am I”。
解析从后向前统计单词
代码class Solution &#123;
public:
    string reverseWords(string s) &#12</div>
      </a>

      <div class="index-btm post-metas">
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-date"></i>&nbsp;2020-09-13
          </div>
        
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-category"></i>
            
              <a href="/michuanblog/categories/LeetCode-LCOF/">LeetCode_LCOF</a>
            
          </div>
        
        
          <div class="post-meta">
            <i class="iconfont icon-tags"></i>
            
              <a href="/michuanblog/tags/LeetCode/">LeetCode</a>
            
              <a href="/michuanblog/tags/C/">C++</a>
            
              <a href="/michuanblog/tags/LCOF/">LCOF</a>
            
              <a href="/michuanblog/tags/%E9%A2%98%E8%A7%A3/">题解</a>
            
          </div>
        
      </div>
    </div>
  </div>

  <div class="row mx-auto index-card">
    
    
    <div class="col-12 col-md-12 mx-auto index-info">
      <a class="index-header" href="/michuanblog/2020/09/13/lcof-57/">lcof_57</a>

      <a href="/michuanblog/2020/09/13/lcof-57/" class="index-excerpt">
        
        
          
        
        <div>LCOF57 和为s的两个数字题目输入一个递增排序的数组和一个数字s，在数组中查找两个数，使得它们的和正好是s。如果有多对数字的和等于s，则输出任意一对即可。
解析前后双指针
代码class Solution &#123;
public:
    vector&lt;int&gt; twoSum(vector&lt;int&gt;&amp; nums, int target) &#123;
   </div>
      </a>

      <div class="index-btm post-metas">
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-date"></i>&nbsp;2020-09-13
          </div>
        
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-category"></i>
            
              <a href="/michuanblog/categories/LeetCode-LCOF/">LeetCode_LCOF</a>
            
          </div>
        
        
          <div class="post-meta">
            <i class="iconfont icon-tags"></i>
            
              <a href="/michuanblog/tags/LeetCode/">LeetCode</a>
            
              <a href="/michuanblog/tags/C/">C++</a>
            
              <a href="/michuanblog/tags/LCOF/">LCOF</a>
            
              <a href="/michuanblog/tags/%E9%A2%98%E8%A7%A3/">题解</a>
            
          </div>
        
      </div>
    </div>
  </div>

  <div class="row mx-auto index-card">
    
    
    <div class="col-12 col-md-12 mx-auto index-info">
      <a class="index-header" href="/michuanblog/2020/09/07/lcof-55-2/">lcof_55_2</a>

      <a href="/michuanblog/2020/09/07/lcof-55-2/" class="index-excerpt">
        
        
          
        
        <div>LCOF55 - II 平衡二叉树题目输入一棵二叉树的根节点，判断该树是不是平衡二叉树。如果某二叉树中任意节点的左右子树的深度相差不超过1，那么它就是一棵平衡二叉树。
解析
递归求左右子树深度，并判断左右子树是否平衡
计算左右子树深度差，判断当前节点树是否平衡

代码/**
 * Definition for a binary tree node.
 * struct TreeNode &#123</div>
      </a>

      <div class="index-btm post-metas">
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-date"></i>&nbsp;2020-09-07
          </div>
        
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-category"></i>
            
              <a href="/michuanblog/categories/LeetCode-LCOF/">LeetCode_LCOF</a>
            
          </div>
        
        
          <div class="post-meta">
            <i class="iconfont icon-tags"></i>
            
              <a href="/michuanblog/tags/LeetCode/">LeetCode</a>
            
              <a href="/michuanblog/tags/C/">C++</a>
            
              <a href="/michuanblog/tags/LCOF/">LCOF</a>
            
              <a href="/michuanblog/tags/%E9%A2%98%E8%A7%A3/">题解</a>
            
          </div>
        
      </div>
    </div>
  </div>

  <div class="row mx-auto index-card">
    
    
    <div class="col-12 col-md-12 mx-auto index-info">
      <a class="index-header" href="/michuanblog/2020/09/07/lcof-55-1/">lcof_55_1</a>

      <a href="/michuanblog/2020/09/07/lcof-55-1/" class="index-excerpt">
        
        
          
        
        <div>LCOF55 - I 二叉树的深度题目输入一棵二叉树的根节点，求该树的深度。从根节点到叶节点依次经过的节点（含根、叶节点）形成树的一条路径，最长路径的长度为树的深度。
解析递归求左右子树最大深度
代码/**
 * Definition for a binary tree node.
 * struct TreeNode &#123;
 *     int val;
 *     TreeNode </div>
      </a>

      <div class="index-btm post-metas">
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-date"></i>&nbsp;2020-09-07
          </div>
        
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-category"></i>
            
              <a href="/michuanblog/categories/LeetCode-LCOF/">LeetCode_LCOF</a>
            
          </div>
        
        
          <div class="post-meta">
            <i class="iconfont icon-tags"></i>
            
              <a href="/michuanblog/tags/LeetCode/">LeetCode</a>
            
              <a href="/michuanblog/tags/C/">C++</a>
            
              <a href="/michuanblog/tags/LCOF/">LCOF</a>
            
              <a href="/michuanblog/tags/%E9%A2%98%E8%A7%A3/">题解</a>
            
          </div>
        
      </div>
    </div>
  </div>

  <div class="row mx-auto index-card">
    
    
    <div class="col-12 col-md-12 mx-auto index-info">
      <a class="index-header" href="/michuanblog/2020/09/07/lcof-54/">lcof_54</a>

      <a href="/michuanblog/2020/09/07/lcof-54/" class="index-excerpt">
        
        
          
        
        <div>LCOF54 二叉搜索树的第k大节点题目给定一棵二叉搜索树，请找出其中第k大的节点。
解析
二叉搜索树，右子树 &gt; 根 &gt; 左子树
逆中序遍历，右-&gt;根-&gt;左
第k大，即逆中序遍历到的第k个节点
利用栈实现非递归逆中序遍历

代码/**
 * Definition for a binary tree node.
 * struct TreeNode &#123;
 *   </div>
      </a>

      <div class="index-btm post-metas">
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-date"></i>&nbsp;2020-09-07
          </div>
        
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-category"></i>
            
              <a href="/michuanblog/categories/LeetCode-LCOF/">LeetCode_LCOF</a>
            
          </div>
        
        
          <div class="post-meta">
            <i class="iconfont icon-tags"></i>
            
              <a href="/michuanblog/tags/LeetCode/">LeetCode</a>
            
              <a href="/michuanblog/tags/C/">C++</a>
            
              <a href="/michuanblog/tags/LCOF/">LCOF</a>
            
              <a href="/michuanblog/tags/%E9%A2%98%E8%A7%A3/">题解</a>
            
          </div>
        
      </div>
    </div>
  </div>

  <div class="row mx-auto index-card">
    
    
    <div class="col-12 col-md-12 mx-auto index-info">
      <a class="index-header" href="/michuanblog/2020/09/07/lcof-52/">lcof_52</a>

      <a href="/michuanblog/2020/09/07/lcof-52/" class="index-excerpt">
        
        
          
        
        <div>LCOF52 两个链表的第一个公共节点题目输入两个链表，找出它们的第一个公共节点。

解析双指针，一起走，短链会先到末尾，短链指针再指向长链头，一起走，两个指针所走节点数相同，第一次相遇的地方即为第一个公共节点
代码/**
 * Definition for singly-linked list.
 * struct ListNode &#123;
 *     int val;
 *     L</div>
      </a>

      <div class="index-btm post-metas">
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-date"></i>&nbsp;2020-09-07
          </div>
        
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-category"></i>
            
              <a href="/michuanblog/categories/LeetCode-LCOF/">LeetCode_LCOF</a>
            
          </div>
        
        
          <div class="post-meta">
            <i class="iconfont icon-tags"></i>
            
              <a href="/michuanblog/tags/LeetCode/">LeetCode</a>
            
              <a href="/michuanblog/tags/C/">C++</a>
            
              <a href="/michuanblog/tags/LCOF/">LCOF</a>
            
              <a href="/michuanblog/tags/%E9%A2%98%E8%A7%A3/">题解</a>
            
          </div>
        
      </div>
    </div>
  </div>

  <div class="row mx-auto index-card">
    
    
    <div class="col-12 col-md-12 mx-auto index-info">
      <a class="index-header" href="/michuanblog/2020/09/06/lcof-42/">lcof_42</a>

      <a href="/michuanblog/2020/09/06/lcof-42/" class="index-excerpt">
        
        
          
        
        <div>LCOF42 连续子数组的最大和题目输入一个整型数组，数组中的一个或连续多个整数组成一个子数组。求所有子数组的和的最大值。
解析
分治
连续子数组最大和，要么出现在数组左边，要么在右边，要么跨越中点
求左边和右边的最大和，是当前问题的子问题，递归求解
跨越中点的，从中点出发分别计算左右两边的最大和，加起来即为结果

代码class Solution &#123;
public:
    int m</div>
      </a>

      <div class="index-btm post-metas">
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-date"></i>&nbsp;2020-09-06
          </div>
        
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-category"></i>
            
              <a href="/michuanblog/categories/LeetCode-LCOF/">LeetCode_LCOF</a>
            
          </div>
        
        
          <div class="post-meta">
            <i class="iconfont icon-tags"></i>
            
              <a href="/michuanblog/tags/LeetCode/">LeetCode</a>
            
              <a href="/michuanblog/tags/C/">C++</a>
            
              <a href="/michuanblog/tags/LCOF/">LCOF</a>
            
              <a href="/michuanblog/tags/%E9%A2%98%E8%A7%A3/">题解</a>
            
          </div>
        
      </div>
    </div>
  </div>

  <div class="row mx-auto index-card">
    
    
    <div class="col-12 col-md-12 mx-auto index-info">
      <a class="index-header" href="/michuanblog/2020/09/06/lcof-30/">lcof_30</a>

      <a href="/michuanblog/2020/09/06/lcof-30/" class="index-excerpt">
        
        
          
        
        <div>LCOF30 包含min函数的栈题目定义栈的数据结构，请在该类型中实现一个能够得到栈的最小元素的 min 函数在该栈中，调用 min、push 及 pop 的时间复杂度都是 O(1)
解析使用两个栈，一个保存入栈元素，一个非降序栈保存最小元素序列
代码class MinStack &#123;
public:
    /** initialize your data structure here.</div>
      </a>

      <div class="index-btm post-metas">
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-date"></i>&nbsp;2020-09-06
          </div>
        
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-category"></i>
            
              <a href="/michuanblog/categories/LeetCode-LCOF/">LeetCode_LCOF</a>
            
          </div>
        
        
          <div class="post-meta">
            <i class="iconfont icon-tags"></i>
            
              <a href="/michuanblog/tags/LeetCode/">LeetCode</a>
            
              <a href="/michuanblog/tags/C/">C++</a>
            
              <a href="/michuanblog/tags/LCOF/">LCOF</a>
            
              <a href="/michuanblog/tags/%E9%A2%98%E8%A7%A3/">题解</a>
            
          </div>
        
      </div>
    </div>
  </div>

  <div class="row mx-auto index-card">
    
    
    <div class="col-12 col-md-12 mx-auto index-info">
      <a class="index-header" href="/michuanblog/2020/09/06/lcof-29/">lcof_29</a>

      <a href="/michuanblog/2020/09/06/lcof-29/" class="index-excerpt">
        
        
          
        
        <div>LCOF29 顺时针打印矩阵题目输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字
解析设置上下左右四个边界
代码class Solution &#123;
public:
    vector&lt;int&gt; spiralOrder(vector&lt;vector&lt;int&gt;&gt;&amp; matrix) &#123;
        vector&lt;int&</div>
      </a>

      <div class="index-btm post-metas">
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-date"></i>&nbsp;2020-09-06
          </div>
        
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-category"></i>
            
              <a href="/michuanblog/categories/LeetCode-LCOF/">LeetCode_LCOF</a>
            
          </div>
        
        
          <div class="post-meta">
            <i class="iconfont icon-tags"></i>
            
              <a href="/michuanblog/tags/LeetCode/">LeetCode</a>
            
              <a href="/michuanblog/tags/C/">C++</a>
            
              <a href="/michuanblog/tags/LCOF/">LCOF</a>
            
              <a href="/michuanblog/tags/%E9%A2%98%E8%A7%A3/">题解</a>
            
          </div>
        
      </div>
    </div>
  </div>

  <div class="row mx-auto index-card">
    
    
    <div class="col-12 col-md-12 mx-auto index-info">
      <a class="index-header" href="/michuanblog/2020/09/06/lcof-27/">lcof_27</a>

      <a href="/michuanblog/2020/09/06/lcof-27/" class="index-excerpt">
        
        
          
        
        <div>LCOF27 二叉树的镜像题目请完成一个函数，输入一个二叉树，该函数输出它的镜像。
解析递归交换左右子树
代码/**
 * Definition for a binary tree node.
 * struct TreeNode &#123;
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNod</div>
      </a>

      <div class="index-btm post-metas">
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-date"></i>&nbsp;2020-09-06
          </div>
        
        
          <div class="post-meta mr-3">
            <i class="iconfont icon-category"></i>
            
              <a href="/michuanblog/categories/LeetCode-LCOF/">LeetCode_LCOF</a>
            
          </div>
        
        
          <div class="post-meta">
            <i class="iconfont icon-tags"></i>
            
              <a href="/michuanblog/tags/LeetCode/">LeetCode</a>
            
              <a href="/michuanblog/tags/C/">C++</a>
            
              <a href="/michuanblog/tags/LCOF/">LCOF</a>
            
              <a href="/michuanblog/tags/%E9%A2%98%E8%A7%A3/">题解</a>
            
          </div>
        
      </div>
    </div>
  </div>



  <nav aria-label="navigation">
    <span class="pagination" id="pagination">
      <a class="extend prev" rel="prev" href="/michuanblog/"><i class="iconfont icon-arrowleft"></i></a><a class="page-number" href="/michuanblog/">1</a><span class="page-number current">2</span><a class="page-number" href="/michuanblog/page/3/">3</a><a class="page-number" href="/michuanblog/page/4/">4</a><a class="page-number" href="/michuanblog/page/5/">5</a><a class="extend next" rel="next" href="/michuanblog/page/3/"><i class="iconfont icon-arrowright"></i></a>
    </span>
  </nav>
  
  <script>
    for (ele of document.getElementById("pagination").getElementsByTagName("a")) {
      ele.href += '#board';
    }
  </script>



              </div>
            </div>
          </div>
        </div>
      </div>
    
  </main>

  
    <a id="scroll-top-button" href="#" role="button">
      <i class="iconfont icon-arrowup" aria-hidden="true"></i>
    </a>
  

  
    <div class="modal fade" id="modalSearch" tabindex="-1" role="dialog" aria-labelledby="ModalLabel"
     aria-hidden="true">
  <div class="modal-dialog modal-dialog-scrollable modal-lg" role="document">
    <div class="modal-content">
      <div class="modal-header text-center">
        <h4 class="modal-title w-100 font-weight-bold">搜索</h4>
        <button type="button" id="local-search-close" class="close" data-dismiss="modal" aria-label="Close">
          <span aria-hidden="true">&times;</span>
        </button>
      </div>
      <div class="modal-body mx-3">
        <div class="md-form mb-5">
          <input type="text" id="local-search-input" class="form-control validate">
          <label data-error="x" data-success="v"
                 for="local-search-input">关键词</label>
        </div>
        <div class="list-group" id="local-search-result"></div>
      </div>
    </div>
  </div>
</div>
  

  
    <!-- APlayer 音乐播放器 -->
    <div id="aplayer"></div>
    <script defer src="https://cdn.staticfile.org/aplayer/1.10.1/APlayer.min.js" ></script>
<link  rel="stylesheet" href="https://cdn.staticfile.org/aplayer/1.10.1/APlayer.min.css" />
<script type="text/javascript">
  var oldLoadAp = window.onload;
  window.onload = function () {
    oldLoadAp && oldLoadAp();

    new APlayer({
      container: document.getElementById('aplayer'),
      fixed: true,
      autoplay: 'false' === 'true',
      loop: 'all',
      order: 'random',
      theme: '#b7daff',
      preload: 'none',
      audio: [{"name":"黄杨扁担","artist":"鹿女王","url":"http://mi_chuan.gitee.io/blog/黄杨扁担.mp3","cover":"http://mi_chuan.gitee.io/blog/黄杨扁担.png"},{"name":"隔世信","artist":"以冬","url":"http://mi_chuan.gitee.io/blog/隔世信.mp3","cover":"http://mi_chuan.gitee.io/blog/隔世信.jpg"}]
    });
  }
</script>

  

  

  <footer class="mt-5">
  <div class="text-center py-3">
    <div>
      <a href="https://hexo.io" target="_blank" rel="nofollow noopener"><span>Hexo</span></a>
      <i class="iconfont icon-love"></i>
      <a href="https://github.com/fluid-dev/hexo-theme-fluid" target="_blank" rel="nofollow noopener">
        <span>Fluid</span></a>
    </div>
    

    

    
  </div>
</footer>

<!-- SCRIPTS -->
<script  src="https://cdn.staticfile.org/jquery/3.4.1/jquery.min.js" ></script>
<script  src="https://cdn.staticfile.org/twitter-bootstrap/4.4.1/js/bootstrap.min.js" ></script>
<script  src="/michuanblog/js/debouncer.js" ></script>
<script  src="/michuanblog/js/main.js" ></script>

<!-- Plugins -->


  
    <script  src="/michuanblog/js/lazyload.js" ></script>
  



  <script defer src="https://cdn.staticfile.org/clipboard.js/2.0.6/clipboard.min.js" ></script>
  <script  src="/michuanblog/js/clipboard-use.js" ></script>









  <script  src="https://cdn.staticfile.org/typed.js/2.0.11/typed.min.js" ></script>
  <script>
    var typed = new Typed('#subtitle', {
      strings: [
        '  ',
        "那时世间有硕大的月亮。我看着你，看坏了眼睛&nbsp;",
      ],
      cursorChar: "_",
      typeSpeed: 70,
      loop: false,
    });
    typed.stop();
    $(document).ready(function () {
      $(".typed-cursor").addClass("h2");
      typed.start();
    });
  </script>





  <script  src="/michuanblog/js/local-search.js" ></script>
  <script>
    var path = "/michuanblog/local-search.xml";
    var inputArea = document.querySelector("#local-search-input");
    inputArea.onclick = function () {
      searchFunc(path, 'local-search-input', 'local-search-result');
      this.onclick = null
    }
  </script>









  
  
    <script>
      !function (e, t, a) {
        function r() {
          for (var e = 0; e < s.length; e++) s[e].alpha <= 0 ? (t.body.removeChild(s[e].el), s.splice(e, 1)) : (s[e].y--, s[e].scale += .004, s[e].alpha -= .013, s[e].el.style.cssText = "left:" + s[e].x + "px;top:" + s[e].y + "px;opacity:" + s[e].alpha + ";transform:scale(" + s[e].scale + "," + s[e].scale + ") rotate(45deg);background:" + s[e].color + ";z-index:99999");
          requestAnimationFrame(r)
        }

        function n() {
          var t = "function" == typeof e.onclick && e.onclick;
          e.onclick = function (e) {
            t && t(), o(e)
          }
        }

        function o(e) {
          var a = t.createElement("div");
          a.className = "heart", s.push({
            el: a,
            x: e.clientX - 5,
            y: e.clientY - 5,
            scale: 1,
            alpha: 1,
            color: c()
          }), t.body.appendChild(a)
        }

        function i(e) {
          var a = t.createElement("style");
          a.type = "text/css";
          try {
            a.appendChild(t.createTextNode(e))
          } catch (t) {
            a.styleSheet.cssText = e
          }
          t.getElementsByTagName("head")[0].appendChild(a)
        }

        function c() {
          return "rgb(" + ~~(255 * Math.random()) + "," + ~~(255 * Math.random()) + "," + ~~(255 * Math.random()) + ")"
        }

        var s = [];
        e.requestAnimationFrame = e.requestAnimationFrame || e.webkitRequestAnimationFrame || e.mozRequestAnimationFrame || e.oRequestAnimationFrame || e.msRequestAnimationFrame || function (e) {
          setTimeout(e, 1e3 / 60)
        }, i(".heart{width: 10px;height: 10px;position: fixed;background: #f00;transform: rotate(45deg);-webkit-transform: rotate(45deg);-moz-transform: rotate(45deg);}.heart:after,.heart:before{content: '';width: inherit;height: inherit;background: inherit;border-radius: 50%;-webkit-border-radius: 50%;-moz-border-radius: 50%;position: fixed;}.heart:after{top: -5px;}.heart:before{left: -5px;}"), n(), r()
      }(window, document);
    </script>
  














<script src="/michuanblog/live2dw/lib/L2Dwidget.min.js?094cbace49a39548bed64abff5988b05"></script><script>L2Dwidget.init({"log":false,"pluginJsPath":"lib/","pluginModelPath":"assets/","pluginRootPath":"live2dw/","tagMode":false});</script></body>
</html>
